A modal logic amalgam of classical and intuitionistic propositional logic
نویسنده
چکیده
We present a modal extension of classical propositional logic in which intuitionistic propositional logic is mirrored by means of the modal operator. In this sense, the modal extension combines classical and intuitionistic propositional logic avoiding the collapsing problem. Adopting ideas from a recent paper (S. Lewitzka, A denotational semantics for a Lewis-style modal system close to S1, 2013), we define a non-Fregean-style semantics such that propositional identity φ ≡ ψ is strict equivalence (φ→ ψ) ∧ (ψ → φ). It turns out that the modal operator , when restricted to propositional formulas, can be regarded as an intuitionistic truth predicate. As a main result, we prove that a propositional formula φ is an intuitionistic theorem iff φ is a theorem of our modal logic. Moreover, we show the existence of models which, for any propositional formula φ, satisfy φ iff φ is an intuitionistic theorem. In the context of such models, the modal operator can be seen as a predicate for intuitionistic validity. Finally, we characterize the class of models as the class of certain Heyting algebras with an operator.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOn the Complexity of Propositional Quantification in Intuitionistic Logic
We define a propositionally quantified intuitionistic logic Her+ by a natural extension of Kripke's semantics for propositional intuitionistic logic. We then show that Har+ is recursively isomorphic to full second order classical logic. Her+ is the intuitionistic analogue of the modal systems S57r+, S47r+, S4.27r+, K47r+, Tir+, K7r+ and Bir+, studied by Fine. ?
متن کاملPropositional mixed logic: its syntax and semantics
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.
متن کاملConstructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic
We consider a general format for sequent rules for not necessarily normal modal logics based on classical or intuitionistic propositional logic and provide relatively simple local conditions ensuring cut elimination for such rule sets. The rule format encompasses e.g. rules for the boolean connectives and transitive modal logics such as S4 or its constructive version. We also adapt the method o...
متن کاملEpistemic extensions of combined classical and intuitionistic propositional logic
Logic L was introduced by Lewitzka [8] as a modal system that combines intuitionistic and classical logic: L is a conservative extension of CPC and it contains a copy of IPC via embedding φ 7→ φ. In this article, we consider L3, i.e. L augmented with S3 modal axioms, define basic epistemic extensions and prove completeness w.r.t. algebraic semantics. Our systems involve, in adapted form, some o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 2017